Perfect imaging with planar interfaces
نویسندگان
چکیده
منابع مشابه
Perfect imaging with planar interfaces.
We describe the most general homogenous, planar, light-ray-direction-changing sheet that performs one-to-one imaging between object space and image space. This is a nontrivial special case (of the sheet being homogenous) of an earlier result [Opt. Commun.282, 2480 (2009)]. Such a sheet can be realized, approximately, with generalized confocal lenslet arrays.
متن کاملQuantification of partial volume effects in planar imaging
Introduction: The limited resolution of the imaging system causes partial volume effects (PVEs). These results in spreading of image counts to the neighboring pixels. This phenomenon is called spill-out effect. This study aimed at quantifying PVEs using ImageJ. Methods:Technetium-99m solution of concentration of 74 kBq/ml was filled into spheres A, B<...
متن کاملPlanar Graphs with Many Perfect Matchings and Forests
We determine the number of perfect matchings and forests in a family Tr,3 of triangulated prism graphs. These results show that the extremal number of perfect matchings in a planar graph with n vertices is bounded below by Ω ( 6 √ 7 + √ 37 n) = Ω (1.535) and the extremal number of forests contained in a planar graph with n vertices is bounded below by
متن کاملHeuristics for planar minimum-weight perfect metchings
Several linear-time approximation algorithms for the minimum-weight perfect matching in a plane are proposed, and their worstand average-case behaviors are analyzed theoretically as well as experimentally. A linear-time approximation algorithm, named the “spiral-rack algorithm (with preprocess and with tour),” is recommended for practical purposes. This algorithm is successfully applied to the ...
متن کاملPlanar Graph Perfect Matching is in NC
Is perfect matching in NC? That is to say, is there a deterministic fast parallel algorithm for it? This has been an outstanding open question in theoretical computer science for over three decades, ever since the discovery of RNC matching algorithms. Within this question, the case of planar graphs has remained an enigma: On the one hand, counting the number of perfect matchings is far harder t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Optical Society of America A
سال: 2013
ISSN: 1084-7529,1520-8532
DOI: 10.1364/josaa.30.002334